Combinatorial optimization - PDFSEARCH.IO - Document Search Engine

Combinatorial optimization
Results: 1158

#	Item
901	MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, [removed] Add to Reading List Source URL: www.merlins-world.de Language: English - Date: 2007-04-13 17:27:56 Complexity classes Operations research Mathematical optimization NP-complete problems Travelling salesman problem NP P versus NP problem Linear programming Combinatorial optimization Theoretical computer science Computational complexity theory Applied mathematics
902	New Inapproximability Bounds for TSP Marek Karpinski∗ Michael Lampis† Richard Schmied‡ Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-26 06:58:50 Combinatorial optimization NP-complete problems Operations research Travelling salesman problem Matching Graph Cut Connectivity Eulerian path Graph theory Mathematics Theoretical computer science
903	November 8, S0129054110007635[removed]:45 WSPC/INSTRUCTION Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2010-12-13 06:54:39 NP-complete problems Matching Analysis of algorithms Graph coloring Combinatorial optimization Independent set Hypergraph Randomized algorithm Induced path Graph theory Theoretical computer science Mathematics
904	Curriculum Vitae Marek Karpinski Dept. of Computer Science and Hausdorff Center for Mathematics University of Bonn Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-27 06:27:04 Complexity classes Approximation algorithms Marek Karpinski Computational problems APX Combinatorial optimization Polynomial-time approximation scheme NP-complete problems Time complexity Theoretical computer science Computational complexity theory Applied mathematics
905	MICHAEL A. TRICK Harry B. and James H. Higgins Professor of Operations Research Senior Associate Dean, Education Tepper School of Business Carnegie Mellon University Pittsburgh, PA 15213 Add to Reading List Source URL: mat.gsia.cmu.edu Language: English - Date: 2014-05-12 16:07:27 Theoretical computer science Linear programming Mathematical optimization COIN-OR Combinatorial optimization Constraint programming Guided Local Search Branch and price DIMACS Operations research Mathematics Applied mathematics
906	MATTHIAS GERDTS OPERATIONS RESEARCH SoSe 2009 Address of the Author: Add to Reading List Source URL: www.unibw.de Language: English - Date: 2013-09-30 11:30:30 Operations research Linear programming Travelling salesman problem Assignment problem Combinatorial optimization Simplex algorithm Cutting-plane method Mathematical optimization Nonlinear programming Mathematics Theoretical computer science Applied mathematics
907	MATTHIAS GERDTS COMBINATORIAL OPTIMISATION MSM 3M02b Address of the Author: Add to Reading List Source URL: www.unibw.de Language: English - Date: 2013-09-30 11:30:30 Operations research Linear programming Computational complexity theory Algorithm Combinatorial optimization Travelling salesman problem Mathematical optimization Greedy algorithm Shortest path problem Theoretical computer science Mathematics Applied mathematics
908	Die Titel der Diskussionspapiere von Nr[removed]bis[removed]können bei Bedarf im Fachbereich Wirtschaftswissenschaft angefordert werden: FernUniversität, z Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-12-05 03:57:21 Mathematics Applied mathematics Combinatorial auction Reverse auction Mathematical optimization Set cover problem Covering problem Relaxation Auction Auction theory Auctioneering Business
909	Die Titel der Diskussionspapiere von Nr[removed]bis[removed]können bei Bedarf im Fachbereich Wirtschaftswissenschaft angefordert werden: FernUniversität, z Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:38 Combinatorial auction Reverse auction Mathematical optimization Auction Combinatorial optimization Contract Auction theory Auctioneering Business
910	Algorithmica[removed]: 323–342 DOI[removed]s00453[removed]Computing Minimum Cuts by Randomized Search Heuristics Frank Neumann · Joachim Reichel · Add to Reading List Source URL: page.math.tu-berlin.de Language: English Combinatorial optimization Operations research Network flow NP-complete problems Minimum cut Maximum flow problem Flow network Cut Maximum cut Graph theory Mathematics Theoretical computer science

UPDATE